Neural networks for constrained optimization problems
نویسندگان
چکیده
منابع مشابه
Implicitly and explicitly constrained optimization problems for training of recurrent neural networks
Training of recurrent neural networks is typically formulated as unconstrained optimization problems. There is, however, an implicit constraint stating that the equations of state must be satisfied at every iteration in the optimization process. Such constraints can make a problem highly non-linear and thus difficult to solve. A potential remedy is to reformulate the problem into one in which t...
متن کاملMapping combinatorial optimization problems onto neural networks
Neural networks have been proposed as a model of computation for solving a wide variety of problems in elds as diverse as combinatorial optimization, vision, and pattern recognition. The ability to map and solve a number of interesting problems on neural networks motivates a proposal for using neural networks as a highly parallel model for general-purpose computing. We review this proposal , an...
متن کاملEquilibrium constrained optimization problems
We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated KKM lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topol...
متن کاملStability Analysis of Gradient-Based Neural Networks for Optimization Problems
| The paper introduces a new approach to analyze the stability of neu-ral network models without using any Lyapunov function. With the new method, we investigate the stability properties of the general gradient-based neural network model for optimization problems. Our discussion includes both isolated equilibrium points and connected equilibrium sets which could be unbounded. For a general opti...
متن کاملTabu search for solving optimization problems on Hopfield neural networks
Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP-hard in heuristic approach. A Hoppeld-type neural network is a method that is often used to solve problems such as Traveling Salesman Problem. However, it is diicult to nd an optimal solution because it is based on gradient descent and its energy function has many l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Circuit Theory and Applications
سال: 1993
ISSN: 0098-9886,1097-007X
DOI: 10.1002/cta.4490210408